Stationary and transient solution of Markovian queues - an alternate approach
نویسندگان
چکیده
Abstract: This paper aims at presenting an alternate approach to derive the exact transient solution of Markovian queues. The continued fraction (Jacobi fraction) is expressed as power series and the power series coefficients are connected by a two-dimensional recurrence relation associated with infinite Stieltjes matrix equation. The recurrence relation is solved by using generating functions. A novel state-dependent birth-death queueing model is taken and expressed as continued fractions by employing integral transforms. The stationary probabilities of general state-dependent Markovian queues are obtained from the continued fractions and its associated tridiagonal determinants. As a special case the time-dependent system size probabilities and busy period distribution of a classical single server queue are deduced using continued fraction and its power series. Numerical illustrations are also presented.
منابع مشابه
A Unified Method of Analysis for Queues with Markovian Arrivals
We deal with finite-buffer queueing systems fed by a Markovian point process. This class includes the queues of type M/G/1/N, M/G/1/N, PH/G/1/N, MMPP/G/1/N, MAP/G/1/N, and BMAP/G/1/N and is commonly used in the performance evaluation of network traffic buffering processes. Typically, such queueing systems are studied in the stationary regime using matrixanalytic methods connected with M/G/1-typ...
متن کاملMatrix Product-Form Solutions for LCFS Preemptive Service Single-Server Queues with Batch Markovian Arrival Streams
This paper considers three variants of last-come first-served (LCFS) preemptive service single-server queues, where customers are served under the LCFS preemptive resume (LCFS-PR), preemptive repeat-different (LCFS-PD), and preemptive repeat-identical (LCFS-PI) disciplines, respectively. These LCFS queues are fed by multiple batch Markovian arrival streams. Service times of customers from each ...
متن کاملCommuting matrices in the queue length and sojourn time analysis of MAP/MAP/1 queues
Queues with Markovian arrival and service processes, i.e., MAP/MAP/1 queues, have been useful in the analysis of computer and communication systems and di erent representations for their stationary sojourn time and queue length distribution have been derived. More speci cally, the class of MAP/MAP/1 queues lies at the intersection of the class of QBD queues and the class of semi-Markovian queue...
متن کاملAnalysis of Queues with Markovian Service Processes∗
Markovian service process (MSP) is a model similar to the Markovian arrival process (MAP), where arrivals are replaced with service completions. The MSP can represent various queueing models such as vacation models, N -policy models and exceptional service models. We analyze MAP/MSP/1 queues and obtain a new sort of matrix-type factorization of the vector generating function for the stationary ...
متن کاملDynamic routing of real-time jobs among parallel EDF queues: A performance study
:هلاقم هصلاخ This paper introduces an analytical method for approximating the performance of a -soft real-time system consisting of a number of parallel infinite-capacity single -server queues. The service discipline for the individual queues is earliest-deadline first (EDF). Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. Jobs either all ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJMOR
دوره 5 شماره
صفحات -
تاریخ انتشار 2013